1342 - 2812 Level - wise Node Size Distribution of Randomly Generated Regular Trees
نویسنده
چکیده
منابع مشابه
Analysis of three graph parameters for random trees
We consider three basic graph parameters, the node-independence number, the path node-covering number, and the size of the kernel, and study their distributional behaviour for an important class of random tree models, namely the class of simply generated trees, which contains, e.g., binary trees, rooted labelled trees and planted plane trees, as special instances. We can show for simply generat...
متن کاملAnalysis of some statistics for increasing tree families
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of increasing trees. Increasing trees are labelled rooted trees where labels along any branch from the root go in increasing order. Many important tree families that have applications in computer science or are used as probabilistic models in various applications, like recursive trees, heap-ordered ...
متن کاملLimit distribution of the degrees in scaled attachment random recursive trees
We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...
متن کاملتنظیم و کاربرد الگوریتم جنگل تصادفی در ارزیابی ژنومی
One of the most important issues in genomic selection is using a decent method for estimating marker effects and genomic evaluation. Recently, machine learning algorithms which are members of non-parametric and non-linear methods have been extended to genomic evaluation. One of these methods is Random Forest (RF) on which this research was focused. Important parameters in RF algorithm are the n...
متن کاملThe left-right-imbalance of binary search trees
Abstract. We present a detailed study of left-right-imbalance measures for random binary search trees under the random permutation model, i.e., where binary search trees are generated by random permutations of {1, 2, . . . , n}. For random binary search trees of size n we study (i) the difference between the left and the right depth of a randomly chosen node, (ii) the difference between the lef...
متن کامل